Simple structures axiomatized by almost sure theories

نویسنده

  • Ove Ahlman
چکیده

In this article we give a classi cation of the binary, simple, ω−categorical structures with SU−rank 1 and trivial pregeometry. This is done both by showing that they satisfy certain extension properties, but also by noting that they may be approximated by the almost sure theory of some sets of nite structures equipped with a probability measure. This study give results about general almost sure theories, but also considers certain attributes which, if they are almost surely true, generate almost sure theories with very speci c properties such as ω−stability or strong minimality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi finitely axiomatizable totally categorical theories

As was shown in [2], totally categorical structures (i.e. which are categorical in all powers) are not finitely axiomatizable. On the other hand, the most simple totally categorical structures: infinite sets, infinite projective or affine geometries over a finite field, are quasi finitely axiomatizable (i.e. axiomatized by a finite number of axioms and the schema of infinity, we will use the ab...

متن کامل

THEORIES IN FINITE MODELTHEORYJohn

Finite model theory stands at the intersection of complexity theory and model theory. Most of the work thus far in nite model theory is analogous to work in 1950's style model theory of rst order logic. That is, the focus is on the study of properties of the logic: expressibility, preservation theorems, criteria for equivalence among models. Around 1960, with Vaught's paper 22], which is still ...

متن کامل

Equational axioms associated with finite automata for fixed point operations in cartesian categories

The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and identities associated with finite automata. We show that the Conway identities and the identities associated with the members of a subclass Q of finite automa...

متن کامل

Remarks on almost-sure theories of Fraïssé classes

In addition to demonstrations that certain concrete classes have 0,1-laws, there are a few general sufficient conditions now known guaranteeing that an א0-categorical theory is the almost-sure theory of some Fraïssé class – for example [3] and [16]. In this paper, we work on the converse project: determining what almost-sure theories must be like. We prove two theorems within this project. In t...

متن کامل

A sufficient condition for super-simplicity of almost-sure theories

In Hill [11], it was shown that an almost-sure theory for a Fraïssé class K relative to an asymptotic probability measure with “independent sampling” is necessarily super-simple of finite rank with D(x=x) = 1. In this note, we show that this independent sampling hypothesis is much stronger than necessary. By examining the Aldous-Hoover-Kallenberg (AHK) presentation of an asymptotic probability ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 167  شماره 

صفحات  -

تاریخ انتشار 2016